It is decidable whether a regular language is pure context-free

It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular

The hairpin completion is an operation on formal languages which is inspired by the hairpin formation in biochemistry. Hairpin formations occur naturally within DNA-computing. It has been known that the hairpin completion of a regular language is linear context-free, but not regular, in general. However, for some time it is was open whether the regularity of the hairpin completion of a regular ...

Bisimulation Equivalence is Decidable for all Context-Free Processes

Deciding whether a regular language is power-closed is PSPACE-complete

A regular language L is power-closed if whenever x ∈ L, also x ∈ L for all k ≥ 1. We show that given a deterministic finite automaton A, it is PSPACE-complete to decide whether the language accepted by A is power-closed.

Very low HbA1C, is it a problem?

Dear Editor An important problem to manage diabetes mellitus is controlling the patients` blood glucose. Fluctuation of blood glucose results in molecular biochemistry change and can result in unwanted diabetic complications (1). In clinical practice, hemoglobin A1C (HbA1C) is a common useful laboratory test to follow-up patients with diabetes (2). Sometimes, an unexpecte...

Deciding Whether a Regular Language Is Generated by a Splicing System

Splicing as a binary word/language operation is inspired by the DNA recombination under the action of restriction enzymes and ligases, and was first introduced by Tom Head in 1987. Shortly thereafter, it was proven that the languages generated by (finite) splicing systems form a proper subclass of the class of regular languages. However, the question of whether or not one can decide if a given ...